Solving multi-granularity temporal constraint networks

A System Prototype for Solving Multi-granularity Temporal CSP

Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management applications for mobile systems. This paper reports recent advances in the development of a system for solving temporal constraint satisfaction problems where distance constraints are specified in terms of arbitrary time granul...

Direct Conversions among Multi-Granularity Temporal Constraints

Temporal constraints are part of the specification of many complex application frameworks including planning, scheduling, real-time systems, workflow and cooperative systems. This paper investigates the problem of converting among quantitative temporal constraints expressed in terms of different time granularities. An expressive formal model for time granularities is assumed including common gr...

GSTP: A Temporal Reasoning System Supporting Multi-Granularity Temporal Constraints

Heuristic search using heuristics extracted from the delete relaxation is one of the most effective methods in planning. Since finding the optimal solution of the delete relaxation is intractable, various heuristics introduce independence assumptions, the implications of which are not yet fully understood. Here we use concepts from graph theory to show that in problems with unary action precond...

Temporal Constraint Networks

Processing Temporal Constraint Networks

This paper describes new algorithms for processing quantitative and qualitative Temporal Constraint Satisfaction Problems (TCSP). In contrast to discrete Constraint Satisfaction Problems (CSP), enforcing path-consistency on quantitative TCSP is exponential, due to the fragmentation problem. Identifying the fragmentation problem allows us to design several e cient polynomial algorithms that are ...